eneralized tableau associated with colored convolution trees
نویسنده
چکیده
Shannon, A.G., J.C. Turner and K.T. Atanassov, A generalized tableau associated with colored convolution trees, Discrete Mathematics 92 (1991) 329-349. This paper considers the tableaux arising from the colors at different levels of arbitrary order convolution trees. The results are related to the elements which constitute the Pascal-LucasTurner triangles and to various generalizations of the Fibonacci numbers, some formed by altering the order of the recurrence relations and some by coupling some second order recurrence relations.
منابع مشابه
A Refinement of the Formula for k-ary Trees and the Gould-Vandermonde's Convolution
In this paper, we present an involution on some kind of colored k-ary trees which provides a combinatorial proof of a combinatorial sum involving the generalized Catalan numbers Ck,γ(n) = γ kn+γ ( kn+γ n ) . From the combinatorial sum, we refine the formula for k-ary trees and obtain an implicit formula for the generating function of the generalized Catalan numbers which obviously implies a Van...
متن کاملOn convolution properties for some classes of meromorphic functions associated with linear operator
In this paper, we defined two classes $S_{p}^{ast }(n,lambda ,A,B)$ and\ $ K_{p}(n,lambda ,A,B)$ of meromorphic $p-$valent functions associated with a new linear operator. We obtained convolution properties for functions in these classes.
متن کاملThe Prism tableau model for Schubert polynomials
The Schubert polynomials lift the Schur basis of symmetric polynomials into a basis for Z[x1, x2, . . .]. We suggest the prism tableau model for these polynomials. A novel aspect of this alternative to earlier results is that it directly invokes semistandard tableaux; it does so as part of a colored tableau amalgam. In the Grassmannian case, a prism tableau with colors ignored is a semistandard...
متن کاملExploring Parallelization of Conjunctive Branches in Tableau-Based Description Logic Reasoning
Multiprocessor equipment is cheap and ubiquitous now, but users of description logic (DL) reasoners have to face the awkward fact that the major tableau-based DL reasoners can make use only one of the available processors. Recently, researchers have started investigating how concurrent computing can play a role in tableau-based DL reasoning with the intention of fully exploiting the processing ...
متن کاملKeywords. Davenport{schinzel Sequence; Tree; Extremal Problem 0 Extremal Problems for Colored Trees and Davenport{schinzel Sequences
In the theory of generalized Davenport{Schinzel sequences one estimates the maximum lengths of nite sequences containing no subsequence of a given pattern. Here we investigate a further generalization, in which the class of sequences is extended to the class of colored trees. We determine exactly the extremal functions associated with the properly 2-colored path of four vertices and with the mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001